Probabilistic Visibility Evaluation for Direct Illumination

نویسندگان

  • Niels Billen
  • Björn Engelen
  • Ares Lagae
  • Philip Dutré
چکیده

The efficient evaluation of visibility in a three-dimensional scene is a longstanding problem in computer graphics. Visibility evaluations come in many different forms: figuring out what object is visible in a pixel; determining whether a point is visible to a light source; or evaluating the mutual visibility between 2 surface points. This paper provides a new, experimental view on visibility, based on a probabilistic evaluation of the visibility function. Instead of checking the visibility against all possible intervening geometry, the visibility between 2 points is now evaluated by testing only a random subset of objects. The result is not a Boolean value that is either 0 or 1, but a numerical value that can even be negative. Because we use the visibility evaluation as part of the integrand in illumination computations, the probabilistic evaluation of visibility becomes part of the Monte Carlo procedure of estimating the illumination integral, and results in an unbiased computation of illumination values in the scene. Moreover, the number of intersections tests for any given ray is decreased, since only a random selection of geometric primitives is tested. Although probabilistic visibility is an experimental and new idea, we present a practical algorithm for direct illumination that uses the probabilistic nature of visibility evaluations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ارزیابی روشنایی در صنایع الکتریکی تهران

Background and Aim: Lack of quantitative and qualitative data on the current status and the possible adverse effect of poor illumination necessitate the evaluation of the illumination system in the industrial section. To perform quantitative and qualitative assessments of illumination conditions in factories located in the west of Tehran and to look at the adverse consequences of insufficient...

متن کامل

Fast Approximate Quantitative Visibility for Complex Scenes

Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantitative visibility queries, such as (i) what is the average visibility between a point (a differential area element) and a finite area or volume; or (ii) what is the average visibility between two finite areas or volumes....

متن کامل

Interactive Illumination with Coherent Shadow Maps

We present a new method for interactive illumination computations based on precomputed visibility using coherent shadow maps (CSMs). It is well-known that visibility queries dominate the cost of physically based rendering. Precomputing all visibility events, for instance in the form of many shadow maps, enables fast queries and allows for real-time computation of illumination but requires prohi...

متن کامل

Probabilistic visibility evaluation using geometry proxies

Evaluating the visibility between two points is a fundamental problem for ray-tracing and path-tracing algorithms. Ideally, visibility computations are organized such that a minimum number of geometric primitives need to be checked for each ray. Replacing complex geometric shapes by a simpler set of primitives is one strategy to control the amount of intersection calculations. However, approxim...

متن کامل

Directly Visible Pairs and Illumination by Reflections in Orthogonal Polygons

We consider direct visibility in simple orthogonal polygons and derive tight lower and upper bounds on the number of strictly internal and external visibility edges. We also show a lower bound of ⌈n2 ⌉ − 1 on the number of diffuse reflections required for completely illuminating an orthogonal polygon from an arbitrary point inside it. Further, we derive lower bounds on the combinatorial complex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2013